Reasoning About Truth in First-Order Logic
نویسندگان
چکیده
منابع مشابه
Reasoning about Action in First - Order Logic
The main contribution of this paper is a method of axiomatizing actions and their eeects in standard rst-order logic in a way that solves the frame problem. It has long been thought that the frame problem makes monotonic logics inadequate for reasoning about action; this paper shows how to achieve the beneets of a nonmonotonic logic using a monotonic logic. The use of rst-order logic permits co...
متن کاملReasoning about taxonomies in first-order logic
Experts often disagree about the organization of biological taxa. The shifting definitions of taxonomic names complicate otherwise simple queries concerning these taxa. For example, a query such as “how many occurrences of specimens in genus G are recorded in database D” will return different answers depending on whose definition of genus G is used. In our proposed framework, taxonomic classifi...
متن کاملReasoning about Actions and Obligations in First-Order Logic
1. I n t r o d u c t i o n We shall describe a new way in which theories about the deontic status of actions can be represented in terms of the standard two-sorted first-order extensional predicate calculus. This approach towards the formal analysis of such theories has two attractive features: first, it stands in the long and venerable 'anti-intensional' or 'anti-modal' tradition in the logic ...
متن کاملRestricted truth predicates in first-order logic
It is well-known that there exist consistent first-order theories that become inconsistent when we add Tarski’s schema T. This is Tarski’s Theorem. To avoid the inconsistency result, one can restrict Tarski’s schema in different ways. In our paper we restrict Tarski’s schema T by only instantiating the schema with a proper subset of the set of all sentences. We prove several results concerning ...
متن کاملAnytime Reasoning in First-Order Logic
We propose a class of algorithms which gives bestefforts answers to problems in first-order logic given a bound on the resources available for reasoning. The algorithms in this class generate and attempt to solve S1 and S3 approximations to the input problem, then use the results to determine the most likely solution to the input problem. We show that an algorithm in this class outperforms theo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic, Language and Information
سال: 2013
ISSN: 0925-8531,1572-9583
DOI: 10.1007/s10849-012-9168-y